Dependent types for JavaScript

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inferring Types for Asynchronous Arrows in JavaScript

Asynchronous programming with callbacks in JavaScript leads to code that is difficult to understand and maintain. Arrows, a generalization of monads, are an elegant solution to asynchronous program composition. Unfortunately, improper arrow composition can cause mysterious failures with subtle sources. We present an arrows-based DSL in JavaScript which encodes semantics similar to ES6 Promises ...

متن کامل

Monadic Refinement Types for Verifying JavaScript Programs

Researchers have developed several special-purpose type systems and program logics to analyze JavaScript and other dynamically typed programming languages. Still, no prior system can precisely reason about both higher-order programs and mutable state; each system comes with its own delicate soundness proof (when such proofs are provided at all); and tools based on these theories (when they exis...

متن کامل

Dependent Types for Pragmatics

This paper proposes the use of dependent types for pragmatic phenomena such as pronoun binding and presupposition resolution as a typetheoretic alternative to formalisms such as Discourse Representation Theory and Dynamic Semantics.

متن کامل

Games for Dependent Types

We present a model of dependent type theory (DTT) with Π-, 1-, Σand intensional Id-types, which is based on a slight variation of the category of AJM-games and history-free winning strategies. The model satisfies Streicher’s criteria of intensionality and refutes function extensionality. The principle of uniqueness of identity proofs is satisfied. We show it contains a submodel as a full subcat...

متن کامل

Dependent Types for Extensive Games

Extensive games are tools largely used in economics to describe decision processes of a community of agents. In this paper we propose a formal presentation based on the proof assistant Coq which focuses mostly on infinite extensive games and their characteristics. Coq proposes a features called “dependent types”, which means that the type of an object may depend on the type of its components. F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 2012

ISSN: 0362-1340,1558-1160

DOI: 10.1145/2398857.2384659